On Cycles for the Doubling Map Which Are Disjoint from an Interval

نویسندگان

  • KEVIN G. HARE
  • NIKITA SIDOROV
چکیده

Let T : [0, 1] → [0, 1] be the doubling map and let 0 < a < b < 1. We say that an integer n ≥ 3 is bad for (a, b) if all n-cycles for T intersect (a, b). Let B(a, b) denote the set of all n which are bad for (a, b). In this paper we completely describe the sets: D2 = {(a, b) : B(a, b) is finite} and D3 = {(a, b) : B(a, b) = ∅}. In particular, we show that if b − a < 1 6 , then (a, b) ∈ D2, and if b − a ≤ 2 15 , then (a, b) ∈ D3, both constants being sharp.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

OPTIMALIZATION PHASE USING GRAPH MODELLING FOR RELIABLE BUILDING COMPLEXES

During the planning phase of modern, complex, block-structured, large-area located, but still landscape-harmonized health-care buildings, the key is the optimal positioning of the blocks and functions, simultaneously ensuring the most-effective backup-paths for any transportation route failure in the buildings in order to speed up system operation, reduce maintenance costs and especially to imp...

متن کامل

A Procedure for Building Confidence Interval on the Mean of Simulation Output Data

One of the existing methods to build a confidence interval (c.i.) for the mean response in a single steady state simulation system is the batch means method. This method, compared to the other existing methods (autoregressive representation, regenerative cycles, spectrum analysis, standardized time series), is quite easy to understand and to implement and performs relatively well. However, the ...

متن کامل

Multipath Node-Disjoint Routing with Backup List Based on the AODV Protocol

In recent years, routing has been the most focused area in ad hoc networks research. On-demand routing in particular, is widely developed in bandwidth constrained mobile wireless ad hoc networks because of its effectiveness and efficiency. Most proposed on-demand routing protocols are built and relied on single route for each data session. Whenever there is a link disconnection on the active ro...

متن کامل

SOME RESULTS OF CONTINUITY ?f

The dynamical behavior of a map on the unit interval has been the subject of much contemporary research. In this paper, we will consider the relation between the continuity of the map cof and cof for some positive integer k, where f is a continuous map from the unit interval to itself, and ?f is a function which takes any element of the unit interval to the set of all subsequential limits o...

متن کامل

0n removable cycles in graphs and digraphs

In this paper we define the removable cycle that, if $Im$ is a class of graphs, $Gin Im$, the cycle $C$ in $G$ is called removable if $G-E(C)in Im$. The removable cycles in Eulerian graphs have been studied. We characterize Eulerian graphs which contain two edge-disjoint removable cycles, and the necessary and sufficient conditions for Eulerian graph to have removable cycles h...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014